A Study on Analyzing the Grid Road Network Patterns using Relative Neighborhood Graph

نویسنده

  • Daisuke Watanabe
چکیده

Abstract The purpose of this paper is to clarify the properties of road network patterns by considering the relationship between neighborhood intersections. The Relative Neighborhood Graph (RNG), which is one of the proximity graph, is used to analyze the road network patterns of major cities in the United States as a network construction model. The grid-tree proportion (GTP) index and the crossing factor (CF) are used to compare road networks with regular road patterns. Each link in the proximity graphs using the point data of intersections on a digital map is compared with road links. From the result, the RNG links include most of the grid roads but some major streets cannot be described by proximity graphs. The matching ratio for roads increases as the GTP index increases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting Overlapping Communities in Social Networks using Deep Learning

In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...

متن کامل

Analysis of Road Network Pattern Considering Population Distribution and Central Business District

This paper proposes a road network growing model with the consideration of population distribution and central business district (CBD) attraction. In the model, the relative neighborhood graph (RNG) is introduced as the connection mechanism to capture the characteristics of road network topology. The simulation experiment is set up to illustrate the effects of population distribution and CBD at...

متن کامل

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks

In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...

متن کامل

Investigating the functional communication network in patients with knee osteoarthritis using graph-based statistical models

Introduction: Osteoarthritis of the knee is the most prevalent type of arthritis that causes persistent pain and reduces the quality of life. However, no treatment alleviates symptoms or stops the disease from progressing. Functional magnetic resonance imaging (fMRI) studies can provide information on neural mechanisms of pain by assessing correlation patterns among the different regions of the...

متن کامل

On common neighborhood graphs II

Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010